Maximal volume enclosed by plates and proof of the chessboard conjecture

نویسندگان

  • Károly Böröczky
  • Imre Bárány
  • Endre Makai
  • János Pach
چکیده

The following conjecture of Fejes T6th is proved: The density of a lattice of convex bodies in [w” is at least i, provided that each connected component of the complementary set is bounded. The cases of equality are also determined. For any polytope P in [w” one can define a convexification P* (see Section 1) and it is proved that Vol P S Vol P*. It is also shown that if P and P’ are two convex polytopes with facets 4 and FT, resp., and ~{Vol,_,~~~F;u}~~{Vol,_,F~/F~~v} holds for every UE[W”, then Vol P’IVol P < 2”‘(“-‘). So me related questions are also considered.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A short proof of the maximum conjecture in CR dimension one

In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...

متن کامل

On the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture

The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(&plusmn;1 + x(n)), n &isin; N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...

متن کامل

On the oriented perfect path double cover conjecture

‎An  oriented perfect path double cover (OPPDC) of a‎ ‎graph $G$ is a collection of directed paths in the symmetric‎ ‎orientation $G_s$ of‎ ‎$G$ such that‎ ‎each arc‎ ‎of $G_s$ lies in exactly one of the paths and each‎ ‎vertex of $G$ appears just once as a beginning and just once as an‎ ‎end of a path‎. ‎Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete‎ ‎Math‎. ‎276 (2004) 287-294) conjectured that ...

متن کامل

Partial proof of Graham Higman's conjecture related to coset diagrams

Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...

متن کامل

A Brief Determination of Certain Class of Power Semicircle Distribution

In this paper, we give a new and direct proof for the recently proved conjecture raised in Soltani and Roozegar (2012). The conjecture can be proved in a few lines via the integral representation of the Gauss-hypergeometric function unlike the long proof in Roozegar and Soltani (2013).

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 60  شماره 

صفحات  -

تاریخ انتشار 1986